A Three-Valued Linear Temporal Logic for Reasoning about Concurrency
نویسنده
چکیده
منابع مشابه
An automata-theoretic decision procedure for propositional temporal logic with since and until
We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and reenement and make rea...
متن کاملA Tableau for Temporal Logic over the Reals
We provide a simple, sound, complete and terminating tableau decision procedure for the temporal logic of until and since over the real numbers model of time. This logic is an important basis for reasoning about concurrency, metric constraints and planning. Despite its usefulness and long history, there are no existing implementable reasoning techniques for it. The tableau uses a mosaic-based t...
متن کاملModal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many variants...
متن کاملHigher Dimensional Modal Logic
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many variants...
متن کاملAxiomatizations of Interval Logics
Interval logic has been introduced as a temporal logic that provides higher-level constructs and an intuitive graphical representation, making it easier in interval logic than in other temporal logics to specify and reason about concurrency in software and hardware designs. In this paper we present axiomatizations for two propositional interval logics and relate these logics to Until Temporal L...
متن کامل